Online Knapsack Revisited
نویسندگان
چکیده
منابع مشابه
Online Minimization Knapsack Problem
In this paper, we address the online minimization knapsack problem, i. e., the items are given one by one over time and the goal is to minimize the total cost of items that covers a knapsack. We study the removable model, where it is allowed to remove old items from the knapsack in order to accept a new item. We obtain the following results. (i) We propose an 8-competitive deterministic algorit...
متن کاملOnline Knapsack Problems
Since no competitive online algorithms exist for general knapsack problems, we consider online variants of knapsack problems with two assumptions: (i) the weight of each item is very small compared to the knapsack capacity; (ii) the value-to-weight ratio of each item is lower and upper bounded by two positive constants L and U . We design a deterministic threshold-based algorithm for the online...
متن کاملOnline Knapsack Problem under Expected Capacity Constraint
Online knapsack problem is considered, where items arrive in a sequential fashion that have two attributes; value and weight. Each arriving item has to be accepted or rejected on its arrival irrevocably. The objective is to maximize the sum of the value of the accepted items such that the sum of their weights is below a budget/capacity. Conventionally a hard budget/capacity constraint is consid...
متن کاملOnline Knapsack Problems with Limited Cuts
The (offline) maximization (resp., minimization) knapsack problem is given a set of items with weights and sizes, and the capacity of a knapsack, to maximize (resp., minimize) the total weight of selected items under the constraint that the total size of the selected items is at most (resp., at least) the capacity of the knapsack. In this paper, we study online maximization and minimization kna...
متن کاملThe online knapsack problem: Advice and randomization
We study the advice complexity and the random bit complexity of the online knapsack problem. Given a knapsack of unit capacity, and n items that arrive in successive time steps, an online algorithm has to decide for every item whether it gets packed into the knapsack or not. The goal is to maximize the value of the items in the knapsack without exceeding its capacity. In the model of advice com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2014
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-014-9566-4